package binary_search;

public class searchRange {
    public int[] searchRange(int[] nums, int target) {
        int[] ret = new int[2];
        ret[0] = -1;
        ret[1] = -1;
        if(nums.length == 0) {
            return ret;
        }
        int left = 0;
        int right = nums.length - 1;
        //找开始位置
        while(left < right) {
            int mid = left + (right-left)/2;
            if(nums[mid] < target) {
                left = mid+1;
            }else if(nums[mid] >= target) {
                right = mid;
            }
        }
        if(nums[left] != target) {
            return ret;
        }
        ret[0] = right;
        left = 0;
        right = nums.length - 1;
        while(left < right) {
            int mid = left + (right-left+1)/2;
            if(nums[mid] <= target) {
                left = mid;
            }else if(nums[mid] > target) {
                right = mid-1;
            }
        }
        ret[1] = left;
        return ret;
    }
}
